Using Heuristic Search Techniques to Reduce Task Migrations in Peer-to-Peer Volunteer Computing Networks

Massive computations in today's computer applications necessitate the use of high-performance computing environments. Unfor-tunately, high costs and power management must be addressed while operating these Volunteer (VC) enables creation a global network devices capable accumulating their to outperform any supercomputer. VC refers underutilized resources donated by thousands volunteers who want actively participate solving common research problems. However, systems experience unexpected sudden loss connections between volunteers' main server. In this case, server redistribute work new as they become available. This process is known task migration, it already used various volunteer frameworks address unavailability resources. there tendency limit number migrations since are considered technically complex time-consuming process. paper, we employ heuristic search algorithms reduce caused Peer-to-Peer networks locating an alternate path send output files when direct link no longer The simulation results demonstrate that using algorithm eliminates all connections, resulting less total execution time consumption.